The distance between two convex sets
نویسندگان
چکیده
منابع مشابه
Finding the Minimum Distance Between Two Convex Polygons
suppose that a provisional path of coordinated motion has been planned for two rigid polyhedral bodies B1 and B2 in 3-space. Then there will exist functions RI(t), R*(t), x1(t), x2(t) of a parameter t designating time such that the set of points occupied by Bj at time t is Rj(t)Bj + xj(t). TO verify the validity of the proposed motion, one can proceed as follows: find the minimum distance 6 bet...
متن کاملComputing the Minimum Directional Distance between Two Convex Polyhedra
Given two convex polyhedra P and Q and a direction s, the minimum directional distance (MDD) is defined to be the shortest translational distance along the direction s that is required to make P and Q just in contact. In this paper we propose a novel method, called MDD-DUAL , for computing the MDD between two convex polyhedra. The MDD is equivalent to the shortest distance between the origin an...
متن کاملDetermining the minimum translational distance between two convex polyhedra
Convex Polyhedra S. A. Cameron R. K. Culley McDonnell Douglas Research Laboratories Arti cial Intelligence Technology Group St. Louis, MO, USA 63166 Abstract Given two objects we de ne the minimal translational distance (MTD) between them to be the length of the shortest relative translation that results in the objects being in contact. MTD is equivalent to the distance between two objects if t...
متن کاملDistance sets corresponding to convex bodies
Suppose that K ⊆ R, d ≥ 2, is a 0-symmetric convex body which defines the usual norm ‖x‖K = sup {t ≥ 0 : x / ∈ tK} on R. Let also A ⊆ R be a measurable set of positive upper density ρ. We show that if the body K is not a polytope, or if it is a polytope with many faces (depending on ρ), then the distance set DK(A) = {‖x− y‖K : x, y ∈ A} contains all points t ≥ t0 for some positive number t0. Th...
متن کاملSpherical two-distance sets
A set S of unit vectors in n−dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b so that the inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical two-distance sets does not exceed n(n+3)/2. This upper bound is known to be tight for n = 2, 6, 22. The set of midpoints of the edges of a regular simplex g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.03.022